Reflecting random walk in fractal domains

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reflecting Random Walk in Fractal Domains

In this paper, we show that reflecting Brownian motion in any bounded domain D can be approximated, as k → ∞, by simple random walks on “maximal connected” subsets of (2−kZd) ∩D whose filled-in interiors are inside D.

متن کامل

Random walk through fractal environments.

We analyze random walk through fractal environments, embedded in three-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight increments (i.e., of the displacements between two consecutive hittings) is analytically derived from a common, practical definition of fractal dimension, an...

متن کامل

Central Limit Theorem in Multitype Branching Random Walk

A discrete time multitype (p-type) branching random walk on the real line R is considered. The positions of the j-type individuals in the n-th generation form a point process. The asymptotic behavior of these point processes, when the generation size tends to infinity, is studied. The central limit theorem is proved.

متن کامل

Fractal Random Walk and Classification of ECG Signal

This paper presents a new nonlinear method to analyze ventricular arrhythmia(VA) and sinus rhythms(SR). The problem is introduced from the discussion of Fractal Random Walk characteristics of ECG signal. Further, the fractal analysis is used to distinguish ventricular flutter(VFL), ventricular fibrillation(VF), ventricular tachycardia(VT)) and sinus rhythms(SR) from the raw electrocardiogram(EC...

متن کامل

A Random Walk with Exponential Travel Times

Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 2013

ISSN: 0091-1798

DOI: 10.1214/12-aop745